The fractional chromatic number of triangle-free graphs with Δ<3
نویسندگان
چکیده
Let G be a triangle-free graph with maximum degree at most 3. Staton proved that the independence number of G is at least 5 14 |V (G)|. Heckman and Thomas conjectured that Staton’s result can be strengthened into a bound on the fractional chromatic number of G, namely χf (G) ≤ 14 5 . Recently, Hatami and Zhu proved that χf (G) ≤ 3 − 3 64 . In this paper, we prove χf (G) ≤ 3 − 3 43 . © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
N ov 2 01 0 The Fractional Chromatic Number of Triangle - free Graphs with ∆ ≤ 3
Let G be any triangle-free graph with maximum degree ∆ ≤ 3. Staton proved that the independence number of G is at least 5 14 n. Heckman and Thomas conjectured that Staton’s result can be strengthened into a bound on the fractional chromatic number of G, namely χf (G) ≤ 14 5 . Recently, Hatami and Zhu proved χf (G) ≤ 3− 3 64 . In this paper, we prove χf (G) ≤ 3− 3 43 .
متن کاملThe fractional chromatic number of triangle-free subcubic graphs
Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14/5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free subcubic graph is at most 32/11 ≈ 2.909.
متن کاملFractional Coloring of Triangle-Free Planar Graphs
We prove that every planar triangle-free graph on n vertices has fractional chromatic number at most 3− 1 n+1/3 .
متن کاملSubcubic triangle-free graphs have fractional chromatic number at most 14/5
We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus confirming a conjecture of Heckman and Thomas [A new proof of the independence ratio of triangle-free cubic graphs. Discrete Math. 233 (2001), 233–237].
متن کاملThe fractional chromatic number of Zykov products of graphs
Zykov designed one of the oldest known family of triangle-free graphs with arbitrarily high chromatic number. We determine the fractional chromatic number of the Zykov product of a family of graphs. As a corollary, we deduce that the fractional chromatic numbers of the Zykov graphs satisfy the same recurrence relation as those of the Mycielski graphs, that is an+1 = an + 1 an . This solves a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012